Batch scheduling for a single machine processing parts of a single item with increasing processing time to minimize total actual flow time
نویسندگان
چکیده
This research addresses a batch scheduling model for a single machine processing parts of a single item to minimize total actual flow time, defined as interval time from the arrival time to the due date. The part processing time is assumed to be increasing linearly with increasing the waiting time of the part from the batch completion time to its due date. The model consists of the following decision variables: the number of batches (N), batch sizes, starting times of processing, and sequence of the resulting batches. The problem is formulated as a non-linear programming model for which a relaxation is applied by considering variable N to be a parameter. The next step is to solve the model for several values of N, started from N = 1 and increased one by one until a stopping rule is satisfied. This paper is provided with numerical examples to show the characteristics of the model and how effective the proposed algorithm solves the problem
منابع مشابه
Artificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کامل